منابع مشابه
Path Transferability of Planar Graphs
We regard a path as a train moving on a graph. A graph G is called n-transferable if any path of length n can be moved to any other such path by several steps. We will show that every planar graph with minimum degree at least three is at most 10 transferable.
متن کاملLocal Structures in Polyhedral Maps on Surfaces, and Path Transferability of Graphs
We extend Jendrol’ and Skupień’s results about the local structure of maps on the 2-sphere: In this paper we show that if a polyhedral map G on a surface M of Euler characteristic χ(M) ≤ 0 has more than 126|χ(M)| vertices, then G has a vertex with ”nearly” non-negative combinatorial curvature. As a corollary of this, we can deduce that path transferability of such graphs are at most 12. keyword...
متن کاملFrom Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...
متن کاملPath Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.
متن کاملPath-Additions of Graphs
Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors. We show that some classes of graphs are closed under path-addition, including non-planar, right angle crossing, fan-crossing free, quasi-planar, (aligned) bar 1-visibility, and interva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.072